منابع مشابه
Minimization of Boolean Functions
This thesis presents two new methods of test-per-clock BIST design for combinational circuits. One of them is based on a transformation of the PRPG code words into test patterns generated by an ATPG tool. This transformation is done by a combinational circuit. For a design of such a circuit two major tasks have to be solved: first, the proper matching between the PRPG code words and the test pa...
متن کاملAlgorithm for Minimization of Partial Boolean Functions
The paper presents a minimization algorithm for Boolean functions defined by truth tables. It treats only minterms having defined output values and is thus efficient above all in case of highly undefined functions, where the methods processing also the don't care states lose much time. The algorithm proves its full strength for functions with several hundreds of variables and several hundreds o...
متن کاملOBDD Minimization Based on Two-Level Representation of Boolean Functions
ÐIn this paper, we analyze the basic properties of some Boolean function classes and propose a low complexity OBDD variable ordering algorithm, which is exact (optimum) to some classes of functions and very effective to general two-level form functions. We show that the class of series-parallel functions, which can be expressed by a factored form where each variable appears exactly once, can yi...
متن کاملEfficient Minimization Method for Incompletely Defined Boolean Functions
The paper presents a minimization algorithm for Boolean functions whose values are defined only for a small part of their range. In contrast to other known minimization algorithms, it uses the "start big" strategy gradually reducing the dimensionality of a term until an implicant is generated. This approach leads to a very fast solution even for problems with several hundreds of input variables...
متن کاملMinimization Over Boolean Graphs
This paper presents a systematic procedure for the design of gate-type combinational switchingcircuitswithoutdiredtedloops. Eachsuchcircuit(Boo1eangraph) is in correspondencewithasequence of decompositions of the Boolean function which it realizes. A general approach to functional decomposition i s given and, in terms of a convenient positional representation, efficient tests for the detection ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 1965
ISSN: 0862-7940,1572-9109
DOI: 10.21136/am.1965.102933